Dividing a topological space into mutually disjoint and mutually homeomorphic subspaces
نویسندگان
چکیده
منابع مشابه
Mutually Compactificable Topological Spaces
Two disjoint topological spaces X , Y are (T2-) mutually compactificable if there exists a compact (T2-) topology on K = X ∪ Y which coincides on X , Y with their original topologies such that the points x ∈ X , y ∈ Y have open disjoint neighborhoods in K . This paper, the first one from a series, contains some initial investigations of the notion. Some key properties are the following: a topol...
متن کاملon the number of mutually disjoint cyclic designs
we denote by $ls[n](t,k,v)$ a large set of $t$-$(v,k,lambda)$ designs of size $n$, which is a partition of all $k$-subsets ofa $v$-set into $n$ disjoint $t$-$(v,k,lambda)$ designs and$n={v-t choose k-t}/lambda$. we use the notation$n(t,v,k,lambda)$ as the maximum possible number of mutuallydisjoint cyclic $t$-$(v,k,lambda)$designs. in this paper we givesome new bounds for $n(2,29,4,3)$ and ...
متن کاملA Manifold Approach to Learning Mutually Orthogonal Subspaces
Although many machine learning algorithms involve learning subspaces with particular characteristics, optimizing a parameter matrix that is constrained to represent a subspace can be challenging. One solution is to use Riemannian optimization methods that enforce such constraints implicitly, leveraging the fact that the feasible parameter values form a manifold. While Riemannian methods exist f...
متن کاملOn the Number of Mutually Disjoint Cyclic Designs
We denote by LS[N ](t, k, v) a large set of t-(v, k, λ) designs of size N , which is a partition of all k-subsets of a v-set into N disjoint t-(v, k, λ) designs and N = ( v−t k−t ) /λ. We use the notation N(t, v, k, λ) as the maximum possible number of mutually disjoint cyclic t-(v, k, λ)designs. In this paper we give some new bounds for N(2, 29, 4, 3) and N(2, 31, 4, 2). Consequently we presen...
متن کاملBipartite graphs related to mutually disjoint S-permutation matrices
Some numerical characteristics of bipartite graphs in relation to the problem of finding all disjoint pairs of S-permutation matrices in the general n × n case are discussed in this paper. All bipartite graphs of the type g = 〈Rg ∪ Cg, Eg〉, where |Rg| = |Cg | = 2 or |Rg| = |Cg | = 3 are provided. The cardinality of the sets of mutually disjoint S-permutation matrices in both the 4× 4 and 9× 9 c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2002
ISSN: 0166-8641
DOI: 10.1016/s0166-8641(01)00160-2